/**
*      author: Y_Yao
*      created: 2025-02-07 22:52:59
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
int a[2 * N];
int sum[2 * N];
int n,m;

void solve()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        a[n + i] = a[i];
    }

    for(int i = 1;i <= 2 * n;i++)
    {
        sum[i] = (sum[i-1] + a[i]) % m;
    }

    int ans = 0;
    unordered_map<int,int> h;
    for(int i = 1;i <= n;i++)
    {
        h[sum[i]]++;
    }

    for(int i = n + 1;i <= 2 * n;i++)
    {
        h[sum[i - n]]--;
        ans += h[sum[i]];
        h[sum[i]]++;
    }

    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}